Z-Complementary Code Sets With Flexible Lengths From Generalized Boolean Functions

In this paper, new direct constructions of Z-complementary code sets (ZCCSs) from generalized Boolean functions are proposed. the literature, most ZCCS based on lead to sequences power-of-two length. study, we show that our proposed methods result in ZCCSs both length and non-power-of-two Since monomials degrees more than 2 employed constructions, can be obtained. The constructed admit theoretical upper bound size for a when sequence is power two. Also, corresponding peak-to-average-power ratio (PAPR) theoretically upper-bounded set used OFDM. extend applications practical communication systems, e.g., multicarrier CDMA (MC-CDMA) system, by offering flexible lengths, various sizes, bounded PAPR. For example, only one percent 16 128 have PAPRs larger 8 whereas 16.